On Perfect Totient Numbers
نویسندگان
چکیده
Let n > 2 be a positive integer and let φ denote Euler’s totient function. Define φ(n) = φ(n) and φ(n) = φ(φ(n)) for all integers k ≥ 2. Define the arithmetic function S by S(n) = φ(n) + φ(n) + · · ·+ φ(n) + 1, where φ(n) = 2. We say n is a perfect totient number if S(n) = n. We give a list of known perfect totient numbers, and we give sufficient conditions for the existence of further perfect totient numbers.
منابع مشابه
On Arithmetic Functions Related to Iterates of the Schemmel Totient Functions
We begin by introducing an interesting class of functions, known as the Schemmel totient functions, that generalizes the Euler totient function. For each Schemmel totient function Lm, we define two new functions, denoted Rm and Hm, that arise from iterating Lm. Roughly speaking, Rm counts the number of iterations of Lm needed to reach either 0 or 1, and Hm takes the value (either 0 or 1) that t...
متن کاملOn Totient Abundant Numbers
In this note, we find an asymptotic formula for the counting function of the set of totient abundant numbers.
متن کاملOn Sparsely Schemmel Totient Numbers
For each positive integer r, let Sr denote the rth Schemmel totient function, a multiplicative arithmetic function defined by Sr(p) = ( 0, if p r; p↵ 1(p r), if p > r for all primes p and positive integers ↵. The function S1 is simply Euler’s totient function . Masser and Shiu have established several fascinating results concerning sparsely totient numbers, positive integers n satisfying (n) ...
متن کاملA recurrence formula for prime numbers using the Smarandache or Totient functions
In this paper we report a recurrence formula to obtain the n-th prime in terms of (n-l)th prime and as a function of Smarandache or Totient function.
متن کاملOn a Hoggatt-bergum Paper with Totient Function Approach for Divisibility and Congruence Relations
During their discussion of divisibility and congruence relations of the Fibonacci and Lucas numbers, Hoggatt & Bergum found values of n satisfying the congruences Fn E 0 (mod ft) or Ln E 0 (mod ft) . In this connection, Hoggatt & Bergum's research appears in Theorems 1, 3, 5, 6, and 7 of [4]. The present paper originated on the same lines in search of values of n that satisfy <$>(Fn) E 0 (mod f...
متن کامل